Johan Håstad: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Clique is hard to approximate withinn1−ε

Journal:

Acta Mathematica

Year:

1999

Language:

english

File:

PDF, 1.86 MB

english, 1999

2

Some optimal inapproximability results

Journal:

Journal of the ACM

Year:

2001

Language:

english

File:

PDF, 544 KB

english, 2001

3

A Pseudorandom Generator from any One-way Function

HÅstad, Johan, Impagliazzo, Russell, Levin, Leonid A., Luby, Michael

Journal:

SIAM Journal on Computing

Year:

1999

Language:

english

File:

PDF, 530 KB

english, 1999

4

On Lower Bounds for Selecting the Median

Dor, Dorit, Håstad, Johan, Ulfberg, Staffan, Zwick, Uri

Journal:

SIAM Journal on Discrete Mathematics

Year:

2001

Language:

english

File:

PDF, 170 KB

english, 2001

5

Linear-Consistency Testing

Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan

Journal:

Journal of Computer and System Sciences

Year:

2001

Language:

english

File:

PDF, 191 KB

english, 2001

6

Simultaneous Diophantine approximation of rationals by rationals

Jeffrey C Lagarias, Johan T Hastad

Journal:

Journal of Number Theory

Year:

1986

Language:

english

File:

PDF, 1.10 MB

english, 1986

7

Tensor rank is NP-complete

Journal:

Journal of Algorithms

Year:

1990

Language:

english

File:

PDF, 524 KB

english, 1990

8

On the advantage over a random assignment

Johan Håstad, S. Venkatesh

Journal:

Random Structures & Algorithms

Year:

2004

Language:

english

File:

PDF, 222 KB

english, 2004

9

Simultaneously good bases of a lattice and its reciprocal lattice

Johan Håstad, Jeffrey C. Lagarias

Journal:

Mathematische Annalen

Year:

1990

Language:

english

File:

PDF, 567 KB

english, 1990

10

Does co-NP have short interactive proofs?

Ravi B. Boppana, Johan Hastad, Stathis Zachos

Journal:

Information Processing Letters

Year:

1987

Language:

english

File:

PDF, 530 KB

english, 1987

11

A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p

Gunnar Andersson, Lars Engebretsen, Johan Håstad

Journal:

Journal of Algorithms

Year:

2001

Language:

english

File:

PDF, 249 KB

english, 2001

12

A Slight Sharpening of LMN

Journal:

Journal of Computer and System Sciences

Year:

2001

Language:

english

File:

PDF, 106 KB

english, 2001

13

A simple lower bound for monotone clique using a communication game

Mikael Goldmann, Johan Håstad

Journal:

Information Processing Letters

Year:

1992

Language:

english

File:

PDF, 436 KB

english, 1992

14

On average time hierarchies

Mikael Goldmann, Per Grape, Johan Håstad

Journal:

Information Processing Letters

Year:

1994

Language:

english

File:

PDF, 531 KB

english, 1994

15

Statistical zero-knowledge languages can be recognized in two rounds

William Aiello, Johan Hastad

Journal:

Journal of Computer and System Sciences

Year:

1991

Language:

english

File:

PDF, 1.20 MB

english, 1991

16

On bounded occurrence constraint satisfaction

Journal:

Information Processing Letters

Year:

2000

Language:

english

File:

PDF, 82 KB

english, 2000

17

On the complexity of interactive proofs with bounded communication

Oded Goldreich, Johan Håstad

Journal:

Information Processing Letters

Year:

1998

Language:

english

File:

PDF, 958 KB

english, 1998

18

The random oracle hypothesis is false

Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi

Journal:

Journal of Computer and System Sciences

Year:

1994

Language:

english

File:

PDF, 827 KB

english, 1994

19

Fitting points on the real line and its application to RH mapping

Johan Håstad, Lars Ivansson, Jens Lagergren

Journal:

Journal of Algorithms

Year:

2003

Language:

english

File:

PDF, 268 KB

english, 2003

20

Simple analysis of graph tests for linearity and PCP

Johan Håstad, Avi Wigderson

Journal:

Random Structures & Algorithms

Year:

2003

Language:

english

File:

PDF, 168 KB

english, 2003

21

The square lattice shuffle

Journal:

Random Structures & Algorithms

Year:

2006

Language:

english

File:

PDF, 101 KB

english, 2006

22

Simple Constructions of Almost k-wise Independent Random Variables

Noga Alon, Oded Goldreich, Johan Håstad, René Peralta

Journal:

Random Structures & Algorithms

Year:

1992

Language:

english

File:

PDF, 853 KB

english, 1992

23

Majority gates vs. general weighted threshold gates

Mikael Goldmann, Johan Håstad, Alexander Razborov

Journal:

Computational Complexity

Year:

1992

Language:

english

File:

PDF, 1.40 MB

english, 1992

24

On the power of small-depth threshold circuits

Johan Håstad, Mikael Goldmann

Journal:

Computational Complexity

Year:

1991

Language:

english

File:

PDF, 1.04 MB

english, 1991

25

On the Approximation Resistance of a Random Predicate

Journal:

Computational Complexity

Year:

2009

Language:

english

File:

PDF, 511 KB

english, 2009

26

Every 2-csp Allows Nontrivial Approximation

Journal:

Computational Complexity

Year:

2008

Language:

english

File:

PDF, 457 KB

english, 2008

27

Special Issue “Conference on Computational Complexity 2009” Guest Editor’s Foreword

Journal:

Computational Complexity

Year:

2010

Language:

english

File:

PDF, 285 KB

english, 2010

28

The Security of the IAPM and IACBC Modes

Journal:

Journal of Cryptology

Year:

2007

Language:

english

File:

PDF, 161 KB

english, 2007

29

Practical Construction and Analysis of

Johan Håstad, Mats Näslund

Journal:

Journal of Cryptology

Year:

2008

Language:

english

File:

PDF, 405 KB

english, 2008

30

A well-characterized approximation problem

Johan Håstad, Steven Philips, Shmuel Safra

Journal:

Information Processing Letters

Year:

1993

Language:

english

File:

PDF, 459 KB

english, 1993

31

On the shrinkage exponent for read-once formulae

Johan Håstad, Alexander Razborov, Andrew Yao

Journal:

Theoretical Computer Science

Year:

1995

Language:

english

File:

PDF, 767 KB

english, 1995

32

One-way permutations in NC0

Journal:

Information Processing Letters

Year:

1987

Language:

english

File:

PDF, 154 KB

english, 1987

33

Relativized perfect zero knowledge is not BPP

William Aiello, Johan Hastad

Journal:

Information and Computation

Year:

1991

Language:

english

File:

PDF, 1023 KB

english, 1991

34

Randomly Supported Independence and Resistance

Austrin, Per, HÅstad, Johan

Journal:

SIAM Journal on Computing

Year:

2011

Language:

english

File:

PDF, 339 KB

english, 2011

35

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

Guruswami, Venkatesan, HÅstad, Johan, Manokaran, Rajsekar, Raghavendra, Prasad, Charikar, Moses

Journal:

SIAM Journal on Computing

Year:

2011

Language:

english

File:

PDF, 481 KB

english, 2011

36

Reconstructing Truncated Integer Variables Satisfying Linear Congruences

Frieze, Alan M., Hastad, Johan, Kannan, Ravi, Lagarias, Jeffrey C., Shamir, Adi

Journal:

SIAM Journal on Computing

Year:

1988

Language:

english

File:

PDF, 1.88 MB

english, 1988

37

Solving Simultaneous Modular Equations of Low Degree

Journal:

SIAM Journal on Computing

Year:

1988

Language:

english

File:

PDF, 684 KB

english, 1988

38

Monotone Circuits for Connectivity Have Depth (log n) 2-o(1)

Goldmann, Mikael, Håstad, Johan

Journal:

SIAM Journal on Computing

Year:

1998

Language:

english

File:

PDF, 290 KB

english, 1998

39

Tight Bounds for Searching a Sorted Array of Strings

Andersson, Arne, Hagerup, Torben, Håstad, Johan, Petersson, Ola

Journal:

SIAM Journal on Computing

Year:

2000

Language:

english

File:

PDF, 272 KB

english, 2000

40

Circuit Bottom Fan-in and Computational Power

Cai, Liming, Chen, Jianer, Håstad, Johan

Journal:

SIAM Journal on Computing

Year:

1998

Language:

english

File:

PDF, 798 KB

english, 1998

41

Analysis of Backoff Protocols for Multiple Access Channels

Håstad, Johan, Leighton, Tom, Rogoff, Brian

Journal:

SIAM Journal on Computing

Year:

1996

Language:

english

File:

PDF, 4.03 MB

english, 1996

42

Hardness of Approximate Hypergraph Coloring

Guruswami, Venkatesan, Hastad, Johan, Sudan, Madhu

Journal:

SIAM Journal on Computing

Year:

2002

Language:

english

File:

PDF, 269 KB

english, 2002

43

On the Size of Weights for Threshold Gates

Journal:

SIAM Journal on Discrete Mathematics

Year:

1994

Language:

english

File:

PDF, 932 KB

english, 1994

44

On the NP-Hardness of Max-Not-2

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 219 KB

english, 2014

45

[IEEE 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) - Toronto, ON, Canada (1986.10.27-1986.10.29)] 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) - On the power of interaction

Aiellot, William, Goldwasser, Shafi, Hastad, Johan

Year:

1986

Language:

english

File:

PDF, 1.45 MB

english, 1986

46

[IEEE 2012 IEEE Conference on Computational Complexity (CCC) - Porto, Portugal (2012.06.26-2012.06.29)] 2012 IEEE 27th Conference on Computational Complexity - On the Usefulness of Predicates

Austrin, Per, Hastad, Johan

Year:

2012

Language:

english

File:

PDF, 251 KB

english, 2012

47

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Making the Long Code Shorter

Barak, Boaz, Gopalan, Parikshit, Hastad, Johan, Meka, Raghu, Raghavendra, Prasad, Steurer, David

Year:

2012

Language:

english

File:

PDF, 247 KB

english, 2012

48

On the Correlation of Parity and Small-Depth Circuits

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 159 KB

english, 2014

49

[IEEE 28th Annual Symposium on Foundations of Computer Science - Los Angeles, CA, USA (1987.10.12-1987.10.14)] 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) - Perfect zero-knowledge languages can be recognized in two rounds

Aiello, William, Hastad, Johan

Year:

1987

Language:

english

File:

PDF, 1.20 MB

english, 1987

50

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - (2 + epsilon)-Sat Is NP-Hard

Austrin, Per, Hastad, Johan, Guruswami, Venkatesan

Year:

2014

Language:

english

File:

PDF, 332 KB

english, 2014